package middle;

import java.util.HashMap;
import java.util.Map;
import java.util.Objects;

public class Solution_372 {

    public static ThreadLocal<Integer> threadLocal = new ThreadLocal<>();;
    public static void main(String[] args) {
        String uploadUrl = "https://ddmc-common-private-2022.obs.cn-east-3.myhuaweicloud.com:443/scm/IMG_20220627_123620_8380892ee33b4f6e981a8e63acb42a4c.jpg?AccessKeyId=TZMGROAADW4HJ8I6U0LN&Expires=1750913250&Signature=RrgG%2Bl2Y2ezWhjJ8UAQS6l4tLsc%3D";
        if (!uploadUrl.toLowerCase().startsWith("http")) {
            System.out.println("---");
        }
        System.out.println(Objects.equals(1L, null));
        threadLocal.remove();
        threadLocal.set(1);
        threadLocal.set(2);
        System.out.println(threadLocal.get());

//        Solution_372 model = new Solution_372();
//        System.out.println(model.superPow(2, new int[]{3}));
//        System.out.println(model.superPow(2, new int[]{1, 0}));
//        System.out.println(model.superPow(1, new int[]{4,3,3,8,5,2}));
//        System.out.println(model.superPow(2147483647, new int[]{2,0,0}));
//        System.out.println(model.superPow(78267, new int[]{1,7,7,4,3,1,7,0,1,4,4,9,2,8,5,0,0,9,3,1,2,5,9,6,0,9,9,0,9,6,0,5,3,7,9,8,8,9,8,2,5,4,1,9,3,8,0,5,9,5,6,1,1,8,9,3,7,8,5,8,5,5,3,0,4,3,1,5,4,1,7,9,6,8,8,9,8,0,6,7,8,3,1,1,1,0,6,8,1,1,6,6,9,1,8,5,6,9,0,0,1,7,1,7,7,2,8,5,4,4,5,2,9,6,5,0,8,1,0,9,5,8,7,6,0,6,1,8,7,2,9,8,1,0,7,9,4,7,6,9,2,3,1,3,9,9,6,8,0,8,9,7,7,7,3,9,5,5,7,4,9,8,3,0,1,2,1,5,0,8,4,4,3,8,9,3,7,5,3,9,4,4,9,3,3,2,4,8,9,3,3,8,2,8,1,3,2,2,8,4,2,5,0,6,3,0,9,0,5,4,1,1,8,0,4,2,5,8,2,4,2,7,5,4,7,6,9,0,8,9,6,1,4,7,7,9,7,8,1,4,4,3,6,4,5,2,6,0,1,1,5,3,8,0,9,8,8,0,0,6,1,6,9,6,5,8,7,4,8,9,9,2,4,7,7,9,9,5,2,2,6,9,7,7,9,8,5,9,8,5,5,0,3,5,8,9,5,7,3,4,6,4,6,2,3,5,2,3,1,4,5,9,3,3,6,4,1,3,3,2,0,0,4,4,7,2,3,3,9,8,7,8,5,5,0,8,3,4,1,4,0,9,5,5,4,4,9,7,7,4,1,8,7,5,2,4,9,7,9,1,7,8,9,2,4,1,1,7,6,4,3,6,5,0,2,1,4,3,9,2,0,0,2,9,8,4,5,7,3,5,8,2,3,9,5,9,1,8,8,9,2,3,7,0,4,1,1,8,7,0,2,7,3,4,6,1,0,3,8,5,8,9,8,4,8,3,5,1,1,4,2,5,9,0,5,3,1,7,4,8,9,6,7,2,3,5,5,3,9,6,9,9,5,7,3,5,2,9,9,5,5,1,0,6,3,8,0,5,5,6,5,6,4,5,1,7,0,6,3,9,4,4,9,1,3,4,7,7,5,8,2,0,9,2,7,3,0,9,0,7,7,7,4,1,2,5,1,3,3,6,4,8,2,5,9,5,0,8,2,5,6,4,8,8,8,7,3,1,8,5,0,5,2,4,8,5,1,1,0,7,9,6,5,1,2,6,6,4,7,0,9,5,6,9,3,7,8,8,8,6,5,8,3,8,5,4,5,8,5,7,5,7,3,2,8,7,1,7,1,8,7,3,3,6,2,9,3,3,9,3,1,5,1,5,5,8,1,2,7,8,9,2,5,4,5,4,2,6,1,3,6,0,6,9,6,1,0,1,4,0,4,5,5,8,2,2,6,3,4,3,4,3,8,9,7,5,5,9,1,8,5,9,9,1,8,7,2,1,1,8,1,5,6,8,5,8,0,2,4,4,7,8,9,5,9,8,0,5,0,3,5,5,2,6,8,3,4,1,4,7,1,7,2,7,5,8,8,7,2,2,3,9,2,2,7,3,2,9,0,2,3,6,9,7,2,8,0,8,1,6,5,2,3,0,2,0,0,0,9,2,2,2,3,6,6,0,9,1,0,0,3,5,8,3,2,0,3,5,1,4,1,6,8,7,6,0,9,8,0,1,0,4,5,6,0,2,8,2,5,0,2,8,5,2,3,0,2,6,7,3,0,0,2,1,9,0,1,9,9,2,0,1,6,7,7,9,9,6,1,4,8,5,5,6,7,0,6,1,7,3,5,9,3,9,0,5,9,2,4,8,6,6,2,2,3,9,3,5,7,4,1,6,9,8,2,6,9,0,0,8,5,7,7,0,6,0,5,7,4,9,6,0,7,8,4,3,9,8,8,7,4,1,5,6,0,9,4,1,9,4,9,4,1,8,6,7,8,2,5,2,3,3,4,3,3,1,6,4,1,6,1,5,7,8,1,9,7,6,0,8,0,1,4,4,0,1,1,8,3,8,3,8,3,9,1,6,0,7,1,3,3,4,9,3,5,2,4,2,0,7,3,3,8,7,7,8,8,0,9,3,1,2,2,4,3,3,3,6,1,6,9,6,2,0,1,7,5,6,2,5,3,5,0,3,2,7,2,3,0,3,6,1,7,8,7,0,4,0,6,7,6,6,3,9,8,5,8,3,3,0,9,6,7,1,9,2,1,3,5,1,6,3,4,3,4,1,6,8,4,2,5}));
//        System.out.println(model.dps(2, 1));
//        System.out.println(model.dps(3, 10) + "----" + Math.pow(3, 10) % 1337);
//        System.out.println(model.dps(4, 11) + "----" + Math.pow(4, 11) % 1337);
    }

    private int[] array = new int[11];

    public int superPow(int a, int[] b) {
        a %= 1337;
        array[0] = 1;
        for (int i = 1; i < array.length; i++) {
            array[i] = (array[i - 1] * a) % 1337;
        }

        int[] nums = new int[b.length];
        for (int i = 0; i < b.length; i++) {
            nums[i] = array[b[i]];
        }

        int rst = 1;
        for (int i = 0; i < nums.length; i++) {
            rst = dps(rst, 10);
            rst = rst * nums[i];
            rst %= 1337;
        }
        return rst % 1337;
    }

    private int dps(int a, int b) {
        a %= 1337;
        Map<Integer, Integer> map = new HashMap<>();
        int n = 1, num = a;
        do {
            map.put(n, num);
            n <<= 1;
            num *= num;
            num %= 1337;
        } while (n < b);
        int rst = 1;
        while (b > 0) {
            int m = b & (-b);
            if (m > 0) {
                rst *= map.get(m);
                rst %= 1337;
            }
            b = b & (b - 1);
        }
        return rst;
    }
}
